Parameterized Algorithms for (r, l)-Partization
نویسندگان
چکیده
We consider the (r, l)-Partization problem of finding a set of at most k vertices whose deletion results in a graph that can be partitioned into r independent sets and l cliques. Restricted to perfect graphs and split graphs, we describe sequacious fixed-parameter tractability results for (r, 0)-Partization, parameterized by k and r. For (r, l)-Partization where r + l = 2, we describe an O∗(2k) algorithm for perfect graphs. We then study the parameterized complexity hardness of a generalization of the Above Guarantee Vertex Cover by a reduction from (r, l)-Partization.
منابع مشابه
Parameterized Algorithms for Deletion to (r, ell)-Graphs
For fixed integers r, l ≥ 0, a graph G is called an (r, l)-graph if the vertex set V (G) can be partitioned into r independent sets and l cliques. This brings us to the following natural parameterized questions: Vertex (r, l)-Partization and Edge (r, l)-Partization. An input to these problems consist of a graph G and a positive integer k and the objective is to decide whether there exists a set...
متن کاملParameterized Algorithms for Deletion to (r, `)-Graphs
For fixed integers r, ` ≥ 0, a graph G is called an (r, `)-graph if the vertex set V (G) can be partitioned into r independent sets and ` cliques. This brings us to the following natural parameterized questions: Vertex (r, `)-Partization and Edge (r, `)-Partization. An input to these problems consist of a graph G and a positive integer k and the objective is to decide whether there exists a set...
متن کاملParameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs
For fixed integers r, l ≥ 0, a graph G is called an (r, l)-graph if the vertex set V (G) can be partitioned into r independent sets and l cliques. Such a graph is also said to have cochromatic number r + l. The class of (r, l) graphs generalizes r-colourable graphs (when l = 0) and hence not surprisingly, determining whether a given graph is an (r, l)-graph is NP-hard even when r ≥ 3 or l ≥ 3 i...
متن کاملParameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs
For fixed integers r, ` ≥ 0, a graph G is called an (r, `)-graph if the vertex set V (G) can be partitioned into r independent sets and ` cliques. Such a graph is also said to have cochromatic number r + `. The class of (r, `) graphs generalizes r-colourable graphs (when ` = 0) and hence not surprisingly, determining whether a given graph is an (r, `)-graph is NP-hard even when r ≥ 3 or ` ≥ 3 i...
متن کاملLattice Problems, Gauge Functions and Parameterized Algorithms
Given a k-dimensional subspace M ⊆ R and a full rank integer lattice L ⊆ R, the subspace avoiding problem SAP, defined by Blömer and Naewe [BN07], is to find a shortest vector in L\M . Treating k as a parameter (in the sense of parameterized complexity), we obtain new parameterized approximation and exact algorithms for SAP based on the AKS sieving technique [AKS01]. – Our first result is a ran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 17 شماره
صفحات -
تاریخ انتشار 2013